Abstract Regular Model Checking
نویسندگان
چکیده
Regular Model Checking Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar To cite this version: Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar. Abstract Regular Model Checking. Alur, Rajeev and Peled, Doron A. International Conference on Computer Aided Verification 2004, 2004, Boston, United States. Springer Verlag, pp.372-386, 2004, LNCS. HAL Id: hal-00159512 https://hal.archives-ouvertes.fr/hal-00159512 Submitted on 3 Jul 2007 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires
منابع مشابه
Abstract Regular Tree Model Checking with Nondeterministic Automata
Regular Tree Model Checking with Nondeterministic Automata
متن کاملTowards Applying Mona in Abstract Regular Tree Model Checking
We consider the problem of automated formal verification of modern concurrent software systems. Dealing with such systems, which involves handling unbounded dynamic instantiation, recursion, etc., naturally leads to a need of dealing with infinite state spaces. We suppose states of such systems to be encoded terms with a tree structure and we would like to use the abstract regular tree model ch...
متن کاملCut - offs and Automata in Formal Verification of Infinite - State Systems Habilitation
In this habilitation thesis, we discuss two complementary approaches to formal verification of infinite-state systems—namely, the use cut-offs and automata-based symbolic model checking (especially the so-called regular model checking). The thesis is based on extended versions of multiple conference and journal papers joint into a unified framework and accompanied with a significantly extended ...
متن کاملAbstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection
متن کامل
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended Abstract)
This paper gives a simple and direct algorithm for computing the always regular set of reachable states of a pushdown system. It then exploits this algorithm for obtaining model checking algorithms for linear-time temporal logic as well as for the logic CTL. For the latter, a new technical tool is introduced: pushdown automata with transitions conditioned on regular predicates on the stack cont...
متن کاملINFINITY 2005 Preliminary Version Abstract Regular Tree Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1,2 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tomáš Vojnar 3,4 FIT, Brno University of Technology, Božetěchova 2, CZ-61266, Brno, Czech Republic
متن کامل